Subtorii Allocation Strategies for Torus Connected Networks
نویسندگان
چکیده
In this paper we investigate the problem of how to schedule n independent jobs on an m m torus based network. We develop a model to to quantify the effect of contention for communication links on the dilation of job execution time when multiple jobs share communication links; we then design an efficient algorithm to schedule a set of n independent jobs with different torus size requirements on a given torus with an objective to minimize the total schedule length. We also develop a feasibility algorithm for preemptively scheduling a given set of jobs on a torus of given size with a given deadline. We provide analysis for both the algorithms.
منابع مشابه
Power Allocation Strategies in Block-Fading Two-Way Relay Networks
This paper aims at investigating the superiority of power allocation strategies, based on calculus of variations in a point-to-point two-way relay-assisted channel incorporating the amplify and forward strategy. Single and multilayer coding strategies for two cases of having and not having the channel state information (CSI) at the transmitters are studied, respectively. Using the notion of cal...
متن کاملThe Effects of Technical and Organizational Activities on Redundancy Allocation Problem with Choice of Selecting Redundancy Strategies Using the memetic algorithm
Redundancy allocation problem is one of most important problems in reliability area. This problem involves with the suitable redundancy levels under certain strategies to maximizing system reliability under some constraints. Many changes have been made on this problem to draw the problem near to real situations. Selecting the redundancy strategy, using different system configuration are some of...
متن کاملSymmetric and Folded Tori Connected Torus Network
Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Symmetric Tori connected Torus Network (STTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. We also f...
متن کاملTorus-Connected Cycles: A Simple And Scalable Topology For Interconnection Networks
Supercomputers are today made up of hundreds of thousands of nodes. The interconnection network is responsible for connecting all these nodes to each other. Different interconnection networks have been proposed; high performance topologies have been introduced as a replacement for the conventional topologies of recent decades. A high order, a low degree and a small diameter are the usual proper...
متن کاملA Unified Model for Sub-System Allocation on Product Networks
Product networks are a class of interconnection networks that includes many useful networks such as multi-dimensional mesh, multi-dimensional torus, hypercube, and generalize hypercube. Most existing processor allocation methods are proposed for a specific interconnection network such as 2-D mesh or hypercube. In this research study, a “unified model” for processor allocation is proposed for pa...
متن کامل